PKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar Codes
نویسندگان
چکیده
Polar codes are novel and efficient error correcting codes with low encoding and decoding complexities. These codes have a channel dependent generator matrix which is determined by the code dimension, code length and transmission channel parameters. This paper studies a variant of the McEliece public key cryptosystem based on polar codes, called"PKC-PC". Due to the fact that the structure of polar codes' generator matrix depends on the parameters of channel, we used an efficient approach to conceal their generator matrix. Then, by the help of the characteristics of polar codes and also introducing an efficient approach, we reduced the public and private key sizes of the PKC-PC and increased its information rate compared to the McEliece cryptosystem. It was shown that polar codes are able to yield an increased security level against conventional attacks and possible vulnerabilities on the code-based public key cryptosystems. Moreover, it is indicated that the security of the PKC-PC is reduced to solve NP-complete problems. Compared to other post-quantum public key schemes, we believe that the PKC-PC is a promising candidate for NIST post-quantum crypto standardization.
منابع مشابه
Study of McEliece cryptosystem
This report presents a study of the public-key cryptosystem (PKC) proposed by R. J. McEliece in 1978 [25]. The McEliece cryptosystem is based on error-correcting linear codes and is one of the first and so far the most succesful cryptosystem based on notions of coding theory. The original construction in [25] uses binary Goppa codes to encrypt and decrypt messages. Many other variants of the cr...
متن کاملFault injection's sensitivity of the McEliece PKC
The McEliece public key cryptosystem (PKC) is supposed secure in a post quantum world [2] because there is no e cient quantum algorithm for the underlying problems, which this cryptosystem is built upon. The purpose of this article is to describe in what the structure of the McEliece PKC is sensitive to fault injection. We present the injection fault in the McEliece scheme using Goppa codes and...
متن کاملThe Security of the Gabidulin Public Key Cryptosystem
The Gabidulin Public Key Cryptosystem (PKC), like the well known McEliece PKC, is based on error correcting codes, and was introduced as an alternative to the McEliece system with the claim that much smaller codes could be used, resulting in a more practical system. In this paper an attack on the Gabidulin PKC is given which breaks it for codes of the size envisaged, destroying much of its adva...
متن کاملOverview of the Mceliece Cryptosystem and Its Security
McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details...
متن کاملThe failure of McEliece PKC based on Reed-Muller codes
This paper describes new algorithm for breaking McEliece cryptosystem, built on ReedMuller binary code RM(r,m), which receives the private key from the public key. The algorithm has complexity O(n+nlog2n) bit operations, where n = 2, d = GCD(r,m−1). In the case of GCD(r,m − 1) limitation, attack has polynomial complexity. Practical results of implementation show that McEliece cryptosystems, bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.07672 شماره
صفحات -
تاریخ انتشار 2017